A hypergraph blow-up lemma
نویسندگان
چکیده
منابع مشابه
A hypergraph blow-up lemma
Weobtain a hypergraph generalisation of the graph blow-up lemma proved byKomlós, Sarközy and Szemerédi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of embedding bounded degree hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 39, 275–376, 2011
متن کاملBlow-Up Lemma
The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of ve...
متن کاملA quantitative version of the Blow-up Lemma
In this paper we give a quantitative version of the Blow-up Lemma.
متن کاملAn Extension of the Blow-up Lemma to Arrangeable Graphs
The Blow-up Lemma established by Komlós, Sárközy, and Szemerédi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove several generalisations of this result concerning the embedding of a-arrangeable graphs, where a graph is called aarrangeable if its vertices can be ordered in such a way that the neighbours to the right of any vertex v hav...
متن کاملAn algorithmic version of the blow-up lemma
Recently we developed a new method in graph theory based on the regularity lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, besides the regularity lemma, is the so-called blow-up Ž w Ž .x lemma Komlos, Sarkozy, and Szemeredi Combinatorica, 17, 109]123 1997 . This lemma ́ ́ ̈ ́ helps to find bounded degree spanning subgraph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2011
ISSN: 1042-9832
DOI: 10.1002/rsa.20362